On a dual network exterior point simplex type algorithm and its computational behavior
نویسندگان
چکیده
منابع مشابه
On a dual network exterior point simplex type algorithm and its computational behavior
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solu...
متن کاملOn the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem
The Minimum Cost Network Flow Problem (MCNFP) constitutes a wide category of network flow problems. A Dual Network Exterior Point Simplex Algorithm (DNEPSA) for the MCNFP is presented here, together with some computational results. Similarly to the classical Dual Network Simplex Algorithm (DNSA), the new algorithm starts with a dual feasible tree-solution and, after a number of iterations, it p...
متن کاملDynamic trees in exterior-point Simplex-type algorithms for network flow problems
Recently, a new Dual Network Exterior-Point Simplex Algorithm (DNEPSA) for the Minimum Cost Network Flow Problem (MCNFP) has been developed. In extensive computational studies, DNEPSA performed better than the classical Dual Network Simplex Algorithm (DNSA). In this paper, we present for the first time how to utilize the dynamic trees data structure in the DNEPSA algorithm, in order to achieve ...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملVisualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem
The Minimum Cost Network Flow Problem (MCNFP) constitutes perhaps the most important of the research area of Network Optimization. Recently a new category of algorithms for the MCNFP have been developed. These algorithms belong to a special “exterior type” simplex category and they feature significant tree modifications. This paper presents a new didactic tool for the teaching of this type of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2012
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/2012015